A Fibration Semantics for Pi-Calculus Modules via Abstract MONSTR Rule Systems
نویسنده
چکیده
MONSTR Rule Systems R. Banach Computer Science Dept., Manchester University, Manchester, M13 9PL, U.K.
منابع مشابه
MONSTR II - Suspending Semantics and Independence
The suspending semantic model for the execution of the MONSTR generalised term graph rewriting language is defined. This is the canonical operational semantic model for the MONSTR language. Its correctness with respect to DACTL semantics is discussed, and a number of general theorems on the soundness of suspending executions with respect to DACTL semantics are proved. General theorems are prove...
متن کاملA Translation of the Pi-Caculus Into MONSTR
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...
متن کاملA Translation of the Pi-Calculus Into MONSTR
A translation of the π-calculus into the MONSTR graph rewriting language is described and proved correct. The translation illustrates the heavy cost in practice of faithfully implementing the communication primitive of the π-calculus and similar process calculi. It also illustrates the convenience of representing an evolving network of communicating agents directly within a graph manipulation f...
متن کاملA Calculus of Chemical Systems
In recent years various calculi have been proposed for modelling biological systems, typically intracellular pathways. These calculi generally fall into one of two camps: ones based on process calculi, such as Milner’s pi-calculus [24], and rule-based ones. Examples of the former include [31, 32, 30]; examples of the latter include BIOCHAM, κ, BioNetGen, and Dynamical Grammars [2, 6, 15, 26]. O...
متن کاملFully-abstract concurrent games for pi
We define a semantics for Milner’s pi-calculus, with three main novelties. First, it provides a fully-abstract model for fair testing equivalence, whereas previous semantics covered variants of bisimilarity and the may and must testing equivalences. Second, it is based on reduction semantics, whereas previous semantics were based on labelled transition systems. Finally, it has a strong game sem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996